Search results for "Extreme point"
showing 10 items of 12 documents
Extremal solutions and strong relaxation for nonlinear multivalued systems with maximal monotone terms
2018
Abstract We consider differential systems in R N driven by a nonlinear nonhomogeneous second order differential operator, a maximal monotone term and a multivalued perturbation F ( t , u , u ′ ) . For periodic systems we prove the existence of extremal trajectories, that is solutions of the system in which F ( t , u , u ′ ) is replaced by ext F ( t , u , u ′ ) (= the extreme points of F ( t , u , u ′ ) ). For Dirichlet systems we show that the extremal trajectories approximate the solutions of the “convex” problem in the C 1 ( T , R N ) -norm (strong relaxation).
Characterizing extreme points of polyhedra an extension of a result by Wolfgang Bühler
1982
This paper reconsiders the characterization given by Buhler admitting convex polyhedra of probability distributions on a finite or countable set which are given by systems of linear inequalities more complex than those considered before.
A purification algorithm for semi-infinite programming
1992
Abstract In this paper we present a purification algorithm for semi-infinite linear programming. Starting with a feasible point, the algorithm either finds an improved extreme point or concludes with the unboundedness of the problem. The method is based on the solution of a sequence of linear programming problems. The study of some recession conditions has allowed us to establish a weak assumption for the finite convergence of this algorithm. Numerical results illustrating the method are given.
On the numerical treatment of linearly constrained semi-infinite optimization problems
2000
Abstract We consider the application of two primal algorithms to solve linear semi-infinite programming problems depending on a real parameter. Combining a simplex-type strategy with a feasible-direction scheme we obtain a descent algorithm which enables us to manage the degeneracy of the extreme points efficiently. The second algorithm runs a feasible-direction method first and then switches to the purification procedure. The linear programming subproblems that yield the search direction involve only a small subset of the constraints. These subsets are updated at each iteration using a multi-local optimization algorithm. Numerical test examples, taken from the literature in order to compar…
Indecomposable sets of finite perimeter in doubling metric measure spaces
2020
We study a measure-theoretic notion of connectedness for sets of finite perimeter in the setting of doubling metric measure spaces supporting a weak $(1,1)$-Poincar\'{e} inequality. The two main results we obtain are a decomposition theorem into indecomposable sets and a characterisation of extreme points in the space of BV functions. In both cases, the proof we propose requires an additional assumption on the space, which is called isotropicity and concerns the Hausdorff-type representation of the perimeter measure.
New descent rules for solving the linear semi-infinite programming problem
1994
The algorithm described in this paper approaches the optimal solution of a continuous semi-infinite linear programming problem through a sequence of basic feasible solutions. The descent rules that we present for the improvement step are quite different when one deals with non-degenerate or degenerate extreme points. For the non-degenerate case we use a simplex-type approach, and for the other case a search direction scheme is applied. Some numerical examples illustrating the method are given.
Approximation of Feasible Parameter Set in worst case identification of block-oriented nonlinear models
2003
Abstract The estimation of the Feasible Parameter Set for block-oriented nonlinear models in a worst case setting is considered. A bounding procedure is determined both for polytopic and ellipsoidie sets, consisting in the projection of the FPS ⊂ R MN of the extended parameter vector onto suitable M or N-dimensional subspaces and in the solution of convex optimization problems which provide the extreme points of the Parameter Uncertainties Intervals of the model parameteres. Bounds obtained are tighter then in the previous approaches.
MR2370688 (2009e:46013) Navarro-Pascual, J. C.; Mena-Jurado, J. F.; Sánchez-Lirola, M. G. A two-dimensional inequality and uniformly continuous retra…
2009
Let X be an infinite-dimensional uniformly convex Banach space and let BX and SX be its closed unit ball and unit sphere, respectively. The main result of the paper is that the identity mapping on BX can be expressed as the mean of n uniformly continuous retractions from BX onto SX for every n >= 3. Then, the authors observe that the result holds under a property weaker than uniform convexity, satisfied by any complex Banach space, so that the result generalizes that of [A. Jim´enez-Vargas et al., Studia Math. 135 (1999), no. 1, 75–81; MR1686372 (2000b:46025)]. As an application the extremal structure of spaces of vector-valued uniformly continuous mappings is studied.
Strongly extreme points and approximation properties
2017
We show that if $x$ is a strongly extreme point of a bounded closed convex subset of a Banach space and the identity has a geometrically and topologically good enough local approximation at $x$, then $x$ is already a denting point. It turns out that such an approximation of the identity exists at any strongly extreme point of the unit ball of a Banach space with the unconditional compact approximation property. We also prove that every Banach space with a Schauder basis can be equivalently renormed to satisfy the sufficient conditions mentioned. In contrast to the above results we also construct a non-symmetric norm on $c_0$ for which all points on the unit sphere are strongly extreme, but …
Simple method for measuring bilayer system optical parameters
2012
A simple method for measuring bilayer system refractive indexes and thicknesses in the low absorbing part of spectra is demonstrated. The method is based on application of Savitzky - Golay smoothing filters and interference fringe separation in the reflected or transmitted spectra of the bilayer system. The refractive indexes and thicknesses are extracted from the wavelengths corresponding to extreme points in the spectrum. Due to the fact that wavelength difference of extreme points in the analyzed spectrum is defined by the product of both, the layer thickness and refractive index, one must generate an appropriate initial guess of these parameters. For refractive index approximation two d…